Metric Regularity of Newton's Iteration
نویسندگان
چکیده
For a version of Newton’s method applied to a generalized equation with a parameter, we extend the paradigm of the Lyusternik-Graves theorem to the framework of a mapping acting from the pair “parameter-starting point” to the set of corresponding convergent Newton’s sequences. Under ample parameterization, metric regularity of the mapping associated with convergent Newton’s sequences becomes equivalent to the metric regularity of the mapping associated with the generalized equation. We also discuss an inexact Newton’s method and present an application to discretized optimal control.
منابع مشابه
A STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT
The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...
متن کاملiteration for ( quasi ) minimizers on metric spaces
We study regularity properties of quasiminimizers of the p-Dirichlet integral on metric measure spaces. We adapt the Moser iteration technique to this setting and show that it can be applied without an underlying differential equation. However, we have been able to run the Moser iteration fully only for minimizers. We prove Caccioppoli inequalities and local boundedness properties for quasisuba...
متن کاملAn Eecient Trust Region Method for Unconstrained Discrete-time Optimal Control Problems 1
Discrete-time optimal control (DTOC) problems are large-scale optimization problems with a dynamic structure. In previous work this structure has been exploited to provide very fast and eecient local procedures. Two examples are the diierential dynamic programming algorithm (DDP) and the stagewise Newton procedure { both require only O(N) operations per iteration, where N is the number of times...
متن کاملNewton's Method for Solving Inclusions Using Set-Valued Approximations
Results on stability of both local and global metric regularity under set-valued perturbations are presented. As an application, we study (super)linear convergence of a Newtontype iterative process for solving generalized equations. We investigate several iterative schemes such as the inexact Newton’s method, the nonsmooth Newton’s method for semismooth functions, the inexact proximal point alg...
متن کاملChaos in Relaxed Newton's Method: The Quadratic Case
In [8], Gilbert Strang explored the chaotic behavior of Newton's method applied to x + 1 when the iteration starts from only real initial conditions. We embed Strang's problem in the one-parameter family of iteration methods known as relaxed Newton's method. By extending this analysis to include a discussion of invariant measures, probability densities, and Lyapunov exponents, we prove that in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Control and Optimization
دوره 49 شماره
صفحات -
تاریخ انتشار 2011